#include "Sort.h"

void TestInsertSort()
{
    int a[] = { 9, 1, 2, 5, 7, 4, 8, 6, 3, 5 };
    InsertSort(a, sizeof(a) / sizeof(int));
    PrintArray(a, sizeof(a) / sizeof(int));
}

void TestShellSort()
{
    //int a[] = { 9, 1,9,3,8, 2, 5, 7, 4, 8, 6, 3, 5, 4,2,3,6,8,2,1,2,2};
    int a[] = { 9,8,7,6,5,4,3,2,1,0,-1,-2,-3,-4,-5};
    ShellSort(a, sizeof(a) / sizeof(int));
    PrintArray(a, sizeof(a) / sizeof(int));
}

void TestSelectSort()
{
    int a[] = { 9, 1, 2, 5, 7, 4, 8, 6, 3, 5 };
    SelectSort(a, sizeof(a) / sizeof(int));
    PrintArray(a, sizeof(a) / sizeof(int));
}

void TestBubbleSort()
{
    int a[] = { 9, 1, 2, 5, 7, 4, 8, 6, 3, 5 };
    BubbleSort(a, sizeof(a) / sizeof(int));
    BubbleSort(a, sizeof(a) / sizeof(int));
    PrintArray(a, sizeof(a) / sizeof(int));
}

void TestQuickSort()
{
    int a[] = { 6,1,2,7,9,3,4,5,10,8 };
    QuickSort(a, 0, sizeof(a) / sizeof(int)-1);
    PrintArray(a, sizeof(a) / sizeof(int));
}

// ≤‚ ‘≈≈–Úµƒ–‘ƒ‹∂‘±»
void TestOP()
{
    srand(time(0));
    const int N = 1000000;
    int* a1 = (int*)malloc(sizeof(int)*N);
    int* a2 = (int*)malloc(sizeof(int)*N);
    int* a3 = (int*)malloc(sizeof(int)*N);
    int* a4 = (int*)malloc(sizeof(int)*N);
    int* a5 = (int*)malloc(sizeof(int)*N);
    int* a6 = (int*)malloc(sizeof(int)*N);
    int* a7 = (int*)malloc(sizeof(int)*N);


    for (int i = 0; i < N; ++i)
    {
        a1[i] = rand();
        a2[i] = a1[i];
        a3[i] = a1[i];
        a4[i] = a1[i];
        a5[i] = a1[i];
        a6[i] = a1[i];
        a7[i] = a1[i];
    }

    //ShellSort(a1, N);

    long int begin1 = clock();
    //InsertSort(a1, N);
    long int end1 = clock();

    long int begin2 = clock();
    ShellSort(a3, N);
    long int end2 = clock();

    long int begin3 = clock();
    //SelectSort(a3, N);
    long int end3 = clock();

    long int begin4 = clock();
    HeapSort(a4, N);
    long int end4 = clock();

    long int begin5 = clock();
    QuickSort(a5, 0, N - 1);
    long int end5 = clock();

    long int begin6 = clock();
    //MergeSort(a6, N);
    long int end6 = clock();

    long int begin7 = clock();
    //BubbleSort(a7, N);
    long int end7 = clock();

    printf("InsertSort:%ld\n", end1 - begin1);
    printf("ShellSort:%ld\n", end2 - begin2);
    printf("SelectSort:%ld\n", end3 - begin3);
    printf("HeapSort:%ld\n", end4 - begin4);
    printf("QuickSort:%ld\n", end5 - begin5);
    printf("MergeSort:%ld\n", end6 - begin6);
    printf("BubbleSort:%ld\n", end7 - begin7);


    free(a1);
    free(a2);
    free(a3);
    free(a4);
    free(a5);
    free(a6);
}

int main()
{
    TestInsertSort();
    TestShellSort();
    TestSelectSort();
    TestBubbleSort();
    TestQuickSort();

    //TestOP();

    return 0;
}
